Variable Sized Online Interval Coloring with Bandwidth
نویسندگان
چکیده
منابع مشابه
Online Capacitated Interval Coloring
In the online capacitated interval coloring problem, a sequence of requests arrive online. Each of the requests is an interval Ij ⊆ {1, 2, . . . , n} with bandwidth bj . Initially a vector of capacities (c1, c2, . . . , cn) is given. Each color can support a set of requests such that the total bandwidth of intervals containing i is at most ci. The goal is to color the requests using a minimum n...
متن کاملOnline Interval Coloring with Packing Constraints
We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardinality constrained coloring, coloring with vector constraints and finally a combination of both the cardinality and the vector constraints. We construct competitive algorithms for each of the variants. Additionally, we ...
متن کاملOnline Interval Coloring and Variants
We study interval coloring problems and present new upper and lower bounds for several variants. We are interested in four problems, online coloring of intervals with and without bandwidth and a new problem called lazy online coloring again with and without bandwidth. We consider both general interval graphs and unit interval graphs. Specifically, we establish the difference between the two mai...
متن کاملOnline Coloring Co-interval Graphs
We study the problem of online coloring co-interval graphs. In this problem, a set of intervals on the real line is presented to the online algorithm in some arbitrary order, and the algorithm must assign each interval a color that is different from the colors of all previously presented intervals not intersecting the current interval. It is known that the competitive ratio of the simple First-...
متن کاملAn improved algorithm for online coloring of intervals with bandwidth
We present an improved online algorithm for coloring interval graphs with bandwidth. This problem has recently been studied byAdamy and Erlebach and a 195-competitive online strategy has been presented. We improve this by presenting a 10-competitive strategy. To achieve this result, we use variants of an optimal online coloring algorithm due to Kierstead and Trotter. © 2006 Elsevier B.V. All ri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2007
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-007-9071-0